On Sombor Index

نویسندگان

چکیده

The concept of Sombor index (SO) was recently introduced by Gutman in the chemical graph theory. It is a vertex-degree-based topological and denoted SO: SO=SO(G)=?vivj?E(G)dG(vi)2+dG(vj)2, where dG(vi) degree vertex vi G. Here, we present novel lower upper bounds on graphs using some parameters. Moreover, obtain several relations with first second Zagreb indices graphs. Finally, give conclusions propose future work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Graovac-Ghorbani index

For the edge e = uv of a graph G, let nu = n(u|G) be the number of vertices of G lying closer to the vertex u than to the vertex v and nv= n(v|G) can be defined simailarly. Then the ABCGG index of G is defined as ABC...

متن کامل

On edge detour index polynomials

The edge detour index polynomials were recently introduced for computing the edge detour indices. In this paper we find relations among edge detour polynomials for the 2-dimensional graph of $TUC_4C_8(S)$ in a Euclidean plane and $TUC4C8(S)$ nanotorus.

متن کامل

On the Higher Randić Index

Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i  v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih  v  v  v  over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher R...

متن کامل

On the forgotten topological index

The forgotten topological index is defined as sum of third power of degrees. In this paper, we compute some properties of forgotten index and then we determine it for some classes of product graphs.

متن کامل

On the Impact of Random Index-Partitioning on Index Compression

The performance of processing search queries depends heavily on the stored index size. Accordingly, considerable research efforts have been devoted to the development of efficient compression techniques for inverted indexes. Roughly, index compression relies on two factors: the ordering of the indexed documents, which strives to position similar documents in proximity, and the encoding of the i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2021

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym13010140